Supplement for the paper entitled “ A BDD - Based Approach for Designing Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems ”

Designing parsimonious representations of the maximally permissive deadlock avoidance policy for complex resource allocation systems through classification theory

A Symbolic Approach for Maximally Permissive Deadlock Avoidance in Complex Resource Allocation Systems

To develop an efficient implementation of the maximally permissive deadlock avoidance policy (DAP) for complex resource allocation systems (RAS), a recent approach focuses on the identification of a set of critical states of the underlying RAS state-space, referred to as minimal boundary unsafe states. The availability of this information enables an expedient one-step-lookahead scheme that prev...

Optimal deadlock avoidance for complex resource allocation systems through classification theory

Most of the past research on the problem of deadlock avoidance for sequential complex resource allocation systems (RAS) has acknowledged the fact that the maximally permissive deadlock avoidance policy (DAP) possesses super-polynomial complexity for most RAS classes, and it has resorted to solutions that trade off maximal permissiveness for computational tractability. In this work, we seek the ...

Distributed Maximally Permissive Nonblocking Control of Flexible Manufacturing Systems

In recent years, a great deal of research has been focused on preventing deadlock in Flexible Manufacturing Systems. Policies based largely on Petri net models have been presented in the literature. Recently, a quite different approach has been developed based on supervisory control theory, and it has been adapted to solve the nonblocking maximally permissive control problem in various resource...

Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks

This paper extends the existing theory on maximally permissive liveness-enforcing supervision of resource allocation systems (RAS) so that it can handle RAS with reader / writer (R/W-) locks. A key challenge that is posed by this new RAS class stems from the fact that the underlying state space is not necessarily finite. We effectively address this obstacle by taking advantage of special struct...